14,402 research outputs found

    Variational formulas of higher order mean curvatures

    Full text link
    In this paper, we establish the first variational formula and its Euler-Lagrange equation for the total 2p2p-th mean curvature functional M2p\mathcal {M}_{2p} of a submanifold MnM^n in a general Riemannian manifold Nn+mN^{n+m} for p=0,1,...,[n2]p=0,1,...,[\frac{n}{2}]. As an example, we prove that closed complex submanifolds in complex projective spaces are critical points of the functional M2p\mathcal {M}_{2p}, called relatively 2p2p-minimal submanifolds, for all pp. At last, we discuss the relations between relatively 2p2p-minimal submanifolds and austere submanifolds in real space forms, as well as a special variational problem.Comment: 13 pages, to appear in SCIENCE CHINA Mathematics 201

    Site symmetry dependence of repulsive interactions between chemisorbed oxygen atoms on Pt{100}-(1×1)

    Get PDF
    [[abstract]]Ab initio total energy calculations using density functional theory with the generalized gradient approximation have been performed for the chemisorption of oxygen atoms on a Pt$100%-~131! slab. Binding energies for the adsorption of oxygen on different high-symmetry sites are presented. The bridge site is the most stable at a coverage of 0.5 ML, followed by the fourfold hollow site. The atop site is the least stable. This finding is rationalized by analyzing the ‘‘local structures’’ formed upon oxygen chemisorption. The binding energies and heats of adsorption at different oxygen coverages show that pairwise repulsive interactions are considerably stronger between oxygen atoms occupying fourfold sites than those occupying bridge sites. Analysis of the partial charge densities associated with Bloch states demonstrates that the O–Pt bond is considerably more localized at the bridge site. These effects cause a sharp drop in the heats of adsorption for oxygen on hollow sites when the coverage is increased from 0.25 to 0.5 ML. Mixing between oxygen p orbitals and Pt d orbitals can be observed over the whole metal d-band energy range.[[notice]]補正完畢[[journaltype]]國內[[booktype]]紙

    Graded reflection equation algebras and integrable Kondo impurities in the one-dimensional t-J model

    Full text link
    Integrable Kondo impurities in two cases of the one-dimensional tJt-J model are studied by means of the boundary Z2{\bf Z}_2-graded quantum inverse scattering method. The boundary KK matrices depending on the local magnetic moments of the impurities are presented as nontrivial realizations of the reflection equation algebras in an impurity Hilbert space. Furthermore, these models are solved by using the algebraic Bethe ansatz method and the Bethe ansatz equations are obtained.Comment: 14 pages, RevTe

    Application of Instantons: Quenching of Macroscopic Quantum Coherence and Macroscopic Fermi-Particle Configurations

    Get PDF
    Starting from the coherent state representation of the evolution operator with the help of the path-integral, we derive a formula for the low-lying levels E=ϵ02ϵcos(s+ξ)πE = \epsilon_0 - 2\triangle\epsilon cos (s+\xi)\pi of a quantum spin system. The quenching of macroscopic quantum coherence is understood as the vanishing of cos(s+ξ)πcos (s+\xi)\pi in disagreement with the suppression of tunneling (i.e. ϵ=0\triangle\epsilon = 0) as claimed in the literature. A new configuration called the macroscopic Fermi-particle is suggested by the character of its wave function. The tunneling rate ((2ϵ)/(π)(2\triangle\epsilon)/(\pi)) does not vanish, not for integer spin s nor for a half-integer value of s, and is calculated explicitly (for the position dependent mass) up to the one-loop approximation.Comment: 13 pages, LaTex, no figure

    Approximating the partition function of the ferromagnetic Potts model

    Full text link
    We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1 under approximation-preserving reducibility. Thus, it is as hard to approximate the partition function as it is to find approximate solutions to a wide range of counting problems, including that of determining the number of independent sets in a bipartite graph. Our proof exploits the first order phase transition of the "random cluster" model, which is a probability distribution on graphs that is closely related to the q-state Potts model.Comment: Minor correction
    corecore